Sequential Routing-Loading Algorithm for Optimizing One-Door Container Closed-Loop Logistics Operations

Optimizing Container Terminal Operations

Returnable container management: Optimizing logistics for manufacturers

This arrangement represents an excellent example of waste and cost reduction, because the containers are durable and reusable. Ideally, there should be little cost for the OEM associated with them beyond initial purchase: containers may need routine maintenance and are replaced as they wear out in the normal course of events. For the suppliers, there should be no cost at all. By driving waste a...

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

A hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty

The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...